Approximate Parametric Dynamic Programming in Inventory Management
نویسندگان
چکیده
We present an approximation method for inventory management under multiple suppliers and stochastic lead times. The method is based on parametric dynamic programming using convex piecewise linear approximations of the differential cost function in approximate relative value iteration steps and works for a range of stochastic control problems with linear dynamics and convex piecewise linear immediate costs. The obtained differential cost approximation not only defines a policy that performs well in practise, it also yields lower bounds that are useful to judge the quality of the corresponding policy or other heuristics. ∗Contact author. Email address: [email protected] †IBM Research Zurich, Saeumerstrasse 4, CH-8803 Rueschlikon, Switzerland. ‡ETH Zurich, Institute for Operations Research, Raemistrasse 101, CH-8092 Zurich, Switzerland.
منابع مشابه
OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملA Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
متن کاملAn Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) using a base-heuristic. We propose a new heuristic which adaptively rounds the solution of the linear programming relaxation. Our computational study suggests: (a) the new heuristic produces high qu...
متن کاملSpare Parts Inventory Management with Substitution-Dependent Reliability
Motivated to apply sustainable supply chain principles to air-pollution control systems, this paper presents a dynamic inventory-management approach where substitution is possible to maintain these systems’ equipment. An air-pollution control system’s subsequent reliability depends on the replacement equipment selected. The corresponding problem is formulated as a stochastic dynamic program. Be...
متن کاملDynamic UAV - based traffic monitoring under uncertainty as a stochastic arc - inventory routing policy
Given the rapid advances in unmanned aerial vehicles, or drones, and increasing need to monitor at a city level, one of the current research gaps is how to systematically deploy drones over multiple periods. We propose a real-time data-driven approach: we formulate the first deterministic arc-inventory routing problem and derive its stochastic dynamic policy. The policy is expected to be of gre...
متن کامل